Probabilistic sophistication and stochastic monotonicity in the Savage framework
نویسندگان
چکیده
Machina and Schmeidler [Machina, M., Schmeidler, D., 1992. A more robust definition of subjective probability. Econometrica 60, 745–780] show that probabilistic sophistication can be obtained in a Savage setting without imposing expected utility by dropping Savage's axiom P2 (sure-thing principle) and strengthening his axiom P4 (weak comparative probability). Their stronger axiom, however, embodies a degree of separability analogous to P2. In this note, we obtain probabilistic sophistication using Savage's original axiom P4 and a weaker analog of Savage's P2. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Bayesian beliefs with stochastic monotonicity: An extension of Machina and Schmeidler
Machina andSchmeidler show that the probabilistic sophistication can be obtained in anAnscombe– Aumann setting without imposing expected utility bymaintaining stochastic monotonicity and adding a new axiom loosely analogous to Savage’s P4. This analogous axiom, however, is very strong. In this note, we obtain probabilistic sophistication using a weaker (and more natural) analog of Savage’s P4. ...
متن کاملEvent Exchangeability: Probabilistic Sophistication without Continuity or Monotonicity by Chew
Building on the Ramsey–de Finetti idea of event exchangeability, we derive a characterization of probabilistic sophistication without requiring any of the various versions of monotonicity, continuity, or comparative likelihood assumptions imposed by Savage (1954), Machina and Schmeidler (1992), and Grant (1995). Our characterization identifies a unique and finitely-additive subjective probabili...
متن کاملSmall worlds: Modeling attitudes toward sources of uncertainty
We introduce the concept of a conditional small world event domain—an extension of Savage’s [The Foundations of Statistics, Wiley, NewYork, 1954] notion of a ‘small world’—as a self-contained collection of comparable events. Under weak behavioral conditions we demonstrate probabilistic sophistication in any small world event domain without relying on monotonicity or continuity. Probabilistic so...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملA Stochastic Model for Water Resources Management
Irrigation water management is crucial for agricultural production and livelihood security in many regions and countries throughout the world. Over the past decades, controversial and conflictladen water-allocation issues among competing municipal, industrial and agricultural interests have raised increasing concerns. Particularly, growing population, varying natural conditions and shrinking wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Social Sciences
دوره 55 شماره
صفحات -
تاریخ انتشار 2008